Fundamental holes and saturation points of a commutative semigroup and their applications to contingency tables
نویسندگان
چکیده
Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is closely related to non-squarefree elements of Markov bases for sampling contingency tables with given marginals. To study a family of systems with no integer solution, we focus on a commutative semigroup generated by a finite subset of Z and its saturation. An element in the difference of the semigroup and its saturation is called a “hole”. We show the necessary and sufficient conditions for the finiteness of the set of holes. Also we define fundamental holes and saturation points of a commutative semigroup. Then, we show the simultaneous finiteness of the set of holes, the set of non-saturation points, and the set of generators for saturation points. We apply our results to some threeand four-way contingency tables.
منابع مشابه
A generalization of the integer linear infeasibility problem
Does a given system of linear equations Ax = b have a nonnegative integer solution? This is a fundamental question in many areas, such as operations research, number theory, and statistics. In terms of optimization, this is called an integer feasibility problem. A generalized integer feasibility problem is to find b such that there does not exist a nonnegative integral solution in the system wi...
متن کاملHoles in Semigroups and Their Applications to the Two-way Common Diagonal Effect Model
A two-way subtable sum model is a statistical model for two-way contingency tables such that sufficient statistics for the model are row sums, column sums and an additional constraint that the sum of a subtable is also fixed. From a statistical viewpoint this model is related to a block interaction model, a twoway change-point model proposed by Hirotsu, and the quasi-independence model for inco...
متن کاملSaturation points on faces of a rational polyhedral cone
Different commutative semigroups may have a common saturation. We consider distinguishing semigroups with a common saturation based on their “sparsity”. We propose to qualitatively describe sparsity of a semigroup by considering which faces of the corresponding rational polyhedral cone have saturation points. For a commutative semigroup we give a necessary and sufficient condition for determini...
متن کاملComputing holes in semi-groups and its applications to transportation problems
An integer feasibility problem is a fundamental problem in many areas, such as operations research, number theory, and statistics. To study a family of systems with no nonnegative integer solution, we focus on a commutative semigroup generated by a finite set of vectors in Z and its saturation. In this paper we present an algorithm to compute an explicit description for the set of holes which i...
متن کامل9 Very ample configurations arising from contingency tables Hidefumi Ohsugi
In this paper, it is proved that, if a toric ideal possesses a fundamental binomial none of whose monomials is squarefree, then the corresponding semigroup ring is not very ample. Moreover, very ample semigroup rings of Lawrence type are discussed. As an application, we study very ampleness of configurations arising from contingency tables.
متن کامل